TSTP Solution File: ITP034^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP034^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:15:59 EDT 2024
% Result : Theorem 0.19s 0.55s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 20 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 9 ( 2 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 65 ( 3 ~; 0 |; 0 &; 62 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
binary1439146945Tree_a: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_sort3,type,
int: $tType ).
thf(decl_22,type,
binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a ).
thf(decl_27,type,
binary339557810e_rm_a: ( a > int ) > binary1439146945Tree_a > a ).
thf(decl_40,type,
ord_less_int: int > int > $o ).
thf(decl_49,type,
h: a > int ).
thf(decl_50,type,
l: a ).
thf(decl_51,type,
t1: binary1439146945Tree_a ).
thf(decl_52,type,
t2: binary1439146945Tree_a ).
thf(decl_53,type,
x: a ).
thf(conj_0,conjecture,
ord_less_int @ ( h @ l ) @ ( h @ ( binary339557810e_rm_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_1_rm__res,axiom,
( ( binary339557810e_rm_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) )
= ( binary339557810e_rm_a @ h @ t2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_rm__res) ).
thf(fact_0_hLess,axiom,
ord_less_int @ ( h @ l ) @ ( h @ ( binary339557810e_rm_a @ h @ t2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_hLess) ).
thf(c_0_3,negated_conjecture,
~ ( ord_less_int @ ( h @ l ) @ ( h @ ( binary339557810e_rm_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_4,negated_conjecture,
~ ( ord_less_int @ ( h @ l ) @ ( h @ ( binary339557810e_rm_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
~ ( ord_less_int @ ( h @ l ) @ ( h @ ( binary339557810e_rm_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,plain,
( ( binary339557810e_rm_a @ h @ ( binary717961607le_T_a @ t1 @ x @ t2 ) )
= ( binary339557810e_rm_a @ h @ t2 ) ),
inference(split_conjunct,[status(thm)],[fact_1_rm__res]) ).
thf(c_0_7,plain,
ord_less_int @ ( h @ l ) @ ( h @ ( binary339557810e_rm_a @ h @ t2 ) ),
inference(split_conjunct,[status(thm)],[fact_0_hLess]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : ITP034^1 : TPTP v8.2.0. Released v7.5.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 15:36:37 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running higher-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.55 # Version: 3.1.0-ho
% 0.19/0.55 # Preprocessing class: HSLSSMSSSSLNHSA.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting pre_casc_6 with 1200s (4) cores
% 0.19/0.55 # Starting sh4 with 600s (2) cores
% 0.19/0.55 # Starting pre_casc_4 with 300s (1) cores
% 0.19/0.55 # Starting full_lambda_7 with 300s (1) cores
% 0.19/0.55 # full_lambda_7 with pid 23138 completed with status 0
% 0.19/0.55 # Result found by full_lambda_7
% 0.19/0.55 # Preprocessing class: HSLSSMSSSSLNHSA.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting pre_casc_6 with 1200s (4) cores
% 0.19/0.55 # Starting sh4 with 600s (2) cores
% 0.19/0.55 # Starting pre_casc_4 with 300s (1) cores
% 0.19/0.55 # Starting full_lambda_7 with 300s (1) cores
% 0.19/0.55 # SinE strategy is GSinE(CountTerms,hypos,2.5,,3,20000,1.0,true)
% 0.19/0.55 # Search class: HGHSM-FSLM32-DHSFFSBN
% 0.19/0.55 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.55 # Starting full_lambda_3 with 139s (1) cores
% 0.19/0.55 # full_lambda_3 with pid 23139 completed with status 0
% 0.19/0.55 # Result found by full_lambda_3
% 0.19/0.55 # Preprocessing class: HSLSSMSSSSLNHSA.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting pre_casc_6 with 1200s (4) cores
% 0.19/0.55 # Starting sh4 with 600s (2) cores
% 0.19/0.55 # Starting pre_casc_4 with 300s (1) cores
% 0.19/0.55 # Starting full_lambda_7 with 300s (1) cores
% 0.19/0.55 # SinE strategy is GSinE(CountTerms,hypos,2.5,,3,20000,1.0,true)
% 0.19/0.55 # Search class: HGHSM-FSLM32-DHSFFSBN
% 0.19/0.55 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.55 # Starting full_lambda_3 with 139s (1) cores
% 0.19/0.55 # Preprocessing time : 0.015 s
% 0.19/0.55
% 0.19/0.55 # Proof found!
% 0.19/0.55 # SZS status Theorem
% 0.19/0.55 # SZS output start CNFRefutation
% See solution above
% 0.19/0.55 # Parsed axioms : 389
% 0.19/0.55 # Removed by relevancy pruning/SinE : 120
% 0.19/0.55 # Initial clauses : 546
% 0.19/0.55 # Removed in clause preprocessing : 5
% 0.19/0.55 # Initial clauses in saturation : 541
% 0.19/0.55 # Processed clauses : 4
% 0.19/0.55 # ...of these trivial : 0
% 0.19/0.55 # ...subsumed : 0
% 0.19/0.55 # ...remaining for further processing : 4
% 0.19/0.55 # Other redundant clauses eliminated : 0
% 0.19/0.55 # Clauses deleted for lack of memory : 0
% 0.19/0.55 # Backward-subsumed : 0
% 0.19/0.55 # Backward-rewritten : 0
% 0.19/0.55 # Generated clauses : 1
% 0.19/0.55 # ...of the previous two non-redundant : 0
% 0.19/0.55 # ...aggressively subsumed : 0
% 0.19/0.55 # Contextual simplify-reflections : 0
% 0.19/0.55 # Paramodulations : 1
% 0.19/0.55 # Factorizations : 0
% 0.19/0.55 # NegExts : 0
% 0.19/0.55 # Equation resolutions : 0
% 0.19/0.55 # Disequality decompositions : 0
% 0.19/0.55 # Total rewrite steps : 1
% 0.19/0.55 # ...of those cached : 0
% 0.19/0.55 # Propositional unsat checks : 0
% 0.19/0.55 # Propositional check models : 0
% 0.19/0.55 # Propositional check unsatisfiable : 0
% 0.19/0.55 # Propositional clauses : 0
% 0.19/0.55 # Propositional clauses after purity: 0
% 0.19/0.55 # Propositional unsat core size : 0
% 0.19/0.55 # Propositional preprocessing time : 0.000
% 0.19/0.55 # Propositional encoding time : 0.000
% 0.19/0.55 # Propositional solver time : 0.000
% 0.19/0.55 # Success case prop preproc time : 0.000
% 0.19/0.55 # Success case prop encoding time : 0.000
% 0.19/0.55 # Success case prop solver time : 0.000
% 0.19/0.55 # Current number of processed clauses : 4
% 0.19/0.55 # Positive orientable unit clauses : 2
% 0.19/0.55 # Positive unorientable unit clauses: 0
% 0.19/0.55 # Negative unit clauses : 2
% 0.19/0.55 # Non-unit-clauses : 0
% 0.19/0.55 # Current number of unprocessed clauses: 537
% 0.19/0.55 # ...number of literals in the above : 1945
% 0.19/0.55 # Current number of archived formulas : 0
% 0.19/0.55 # Current number of archived clauses : 0
% 0.19/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.55 # Non-unit clause-clause subsumptions : 0
% 0.19/0.55 # Unit Clause-clause subsumption calls : 0
% 0.19/0.55 # Rewrite failures with RHS unbound : 0
% 0.19/0.55 # BW rewrite match attempts : 1
% 0.19/0.55 # BW rewrite match successes : 0
% 0.19/0.55 # Condensation attempts : 4
% 0.19/0.55 # Condensation successes : 0
% 0.19/0.55 # Termbank termtop insertions : 59029
% 0.19/0.55 # Search garbage collected termcells : 9124
% 0.19/0.55
% 0.19/0.55 # -------------------------------------------------
% 0.19/0.55 # User time : 0.041 s
% 0.19/0.55 # System time : 0.009 s
% 0.19/0.55 # Total time : 0.050 s
% 0.19/0.55 # Maximum resident set size: 4220 pages
% 0.19/0.55
% 0.19/0.55 # -------------------------------------------------
% 0.19/0.55 # User time : 0.052 s
% 0.19/0.55 # System time : 0.012 s
% 0.19/0.55 # Total time : 0.064 s
% 0.19/0.55 # Maximum resident set size: 2468 pages
% 0.19/0.55 % E---3.1 exiting
% 0.19/0.56 % E exiting
%------------------------------------------------------------------------------